An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
نویسندگان
چکیده
منابع مشابه
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of edges incident to to a same vertex. A rooted trivalent diagram is a trivalent diagram with a distinguished edge, its root. We shall describe and analyze an a...
متن کاملAn Optimal Algorithm to Generate Pointed Trivalent Diagrams and Pointed Triangular Maps
A trivalent diagram is a connected graph with cyclic orientations and degree conditions on its vertices. It is the combinatorial description of an unembedded trivalent ribbon graph. We shall describe and analyze an algorithm giving an exhaustive list of trivalent diagrams of a given size. The list being nonredundant in that no two diagrams of the list are isomorphic. The algorithm will be shown...
متن کاملTrivalent Diagrams, Modular Group and Triangular Maps
The aim of the paper is to give a preliminary overview of some of the results of the thesis prepared by the author. We propose a bijective classification of the subgroups of the modular group by pointed trivalent diagrams. Conjugacy classes of those subgroups are in one to one correspondence with unpointed trivalent diagrams. We also give in the form of generating series, the number of those tr...
متن کاملLinear lambda terms as invariants of rooted trivalent maps
The main aim of the article is to give a simple and conceptual account for the correspondence between (α-equivalence classes of) closed linear lambda terms and (isomorphism classes of) rooted trivalent maps on compact oriented surfaces without boundary, as an instance of a more general correspondence between linear lambda terms with a context of free variables and rooted trivalent maps with a b...
متن کاملAlmost All Rooted Maps Have Large Representativity
Let M be a map on a surface S. The edge-width of M is the length of a shortest non-contractible cycle of M . The face-width (or, representativity) of M is the smallest number of intersections a noncontractible curve in S has with M . (The edge-width and face-width of a planar map may be de ned to be in nity.) A map is an LEW-embedding if its maximum face valency is less than its edge-width. For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.04.026